Muller condition and fairness on multitransition systems
نویسندگان
چکیده
منابع مشابه
the relationship between eq, iq and test format: a study on test fairness
the major aim of this study was to investigate the relationship between iq, eq and test format in the light of test fairness considerations. this study took this relationship into account to see if people with different eq and iq performed differently on different test formats. to this end, 90 advanced learners of english form college of ferdowsi university of mashhad were chosen. they were ask...
15 صفحه اولOn fairness of D0L systems
Aword is called fair if it contains, for each pair of distinct symbols a, b, the same number of occurrences of the scattered subword ab as of ba. We prove that if the first k + 1 words in the sequence generated by a D0L system over a k-letter alphabet are fair then all words in the sequence are fair. © 2007 Elsevier B.V. All rights reserved.
متن کاملFairness in Action Systems
An action system is a framework for describing parallel or distributed systems, for which the reenement calculus ooers a formalisation of the stepwise development method. Fairness is a useful notion in modelling parallel or distributed systems, and this paper extends the reenement calculus to deal with fair action systems. Simulations of fair action systems are obtained by extending simulations...
متن کاملdesigning unmanned aerial vehicle based on neuro-fuzzy systems
در این پایان نامه، کنترل نرو-فازی در پرنده هدایت پذیر از دور (پهپاد) استفاده شده است ابتدا در روش پیشنهادی اول، کنترل کننده نرو-فازی توسط مجموعه اطلاعات یک کنترل کننده pid به صورت off-line آموزش دیده است و در روش دوم یک کنترل کننده نرو-فازی on-line مبتنی بر شناسایی سیستم توسط شبکه عصبی rbf پیشنهاد شده است. سپس کاربرد این کنترل کننده در پهپاد بررسی شده است و مقایسه ای ما بین کنترل کننده های معمو...
Exponential Determinization for ω-Automata with Strong-Fairness Acceptance Condition
In [Saf88] an exponential determinization procedure for Büchi automata was shown, yielding tight bounds for decision procedures of some logics ([EJ88, Saf88, SV89, KT89]). In [SV89] the complexity of determinization and complementation of ω-automata was further investigated, leaving as an open question the complexity of the determinization of a single class of ω-automata. For this class of ω-au...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LMS Journal of Computation and Mathematics
سال: 2011
ISSN: 1461-1570
DOI: 10.1112/s1461157010000136